weak-reversible Markov chains
نویسندگان
چکیده
The theory of L-spectral gaps for reversible Markov chains has been studied by many authors. In this paper we consider positive recurrent general state space Markov chains with stationary transition probabilities. Replacing the assumption of reversibility by a less strong one, we still obtain a simple necessary and sufficient condition for the spectral gap property of the associated Markov operator in terms of isoperimetric constant. Moreover, we define a new sequence of isoperimetric constants which provides a necessary and sufficient condition for the existence of a spectral gap in a very general setting. Finally, these results are used to obtain simple sufficient conditions for the existence of a spectral gap in terms of the first and second order transition probabilities.
منابع مشابه
A Modification of Neal’s Algorithm for a Continuous State Space and an Application to the Fokker-planck Equation
The Metropolis-Hastings algorithm generates correlated samples from a target distribution by constructing a Markov chain which has as its stationary distribution the desired target distribution. One property of this algorithm is that it creates reversible Markov chains. As a result, reversible chains are often used in Monte Carlo simulations. Reversible Markov chains also have the added benefit...
متن کاملOn Non-reversible Markov Chains
Reversibility is a suucient but not necessary condition for Markov chains for use in Markov chain Monte Carlo simulation. It is necessary to select a Markov chain that has a pre-speciied distribution as its unique stationary distribution. There are many Markov chains that have such property. We give guidelines on how to rank them based on the asymptotic variance of the estimates they produce. T...
متن کاملChapter 3 Reversible Markov Chains
Chapter 2 reviewed some aspects of the elementary theory of general nite irreducible Markov chains. In this chapter we specialize to reversible chains, treating the discrete and continuous-time cases in parallel. After section 3 we shall assume that we are dealing with reversible chains without continually repeating this assumption, and shall instead explicitly say \general" to mean not-necessa...
متن کاملEigenvalues of non-reversible Markov chains: their connection to mixing times, reversible Markov chains, and Cheeger inequalities
We show a lower bound on mixing time for a non-reversible Markov chain in terms of its eigenvalues. This is used to show a bound on the real part of the complex-valued eigenvalues in terms of the realvalued eigenvalues of a related reversible chain, and likewise to bound the second largest magnitude eigenvalue. A myriad of Cheeger-like inequalities also follow for non-reversible chains, which e...
متن کاملElectrical Networks and Reversible Markov Chains
The object of this part of the course is to show how the mathematics of finite electrical networks can be used in the study of reversible Markov chains on finite and countable state spaces. The basis of the connection is that harmonic functions for reversible Markov chains can be interpreted as voltages for electrical networks. Thus, techniques for calculating, approximating, and bounding volta...
متن کامل